Divide and conquer is a general problem solving technique to take a large prolem and braek it into smaller pieces, ecah of which is then easier to solve. In computer algorithms, the same divide and conquer approach is usually performed recursively on the parts. In a distributed computing setting, such as MapReduce, different processors may attack different sub-problems. In an agent-base dplatform, different agents may divide up a problem beased on their expertise.
Used on page 341